Vicinal orders of trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trees and circle orders

This paper continues a recent resurgence of interest in combinatorial properties of a poset that are associated with graph properties of its cover graph and order diagram. The following two theorems appearing in a 1977 paper of Trotter and Moore have played important roles in motivating this more modern research: (1) The dimension of a poset is at most 3 when its cover graph is at tree; (2) The...

متن کامل

Comparison of Additive Trees Using Circular Orders

It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting species relationships is associated with a matrix of distances between the species considered which is called a distance matrix or a tree metric matrix. A circular order of elements of X corresponds to a circular (clockwise...

متن کامل

Trees, Linear Orders and Gâteaux Smooth Norms

We introduce a linearly ordered set Z and use it to prove a necessity condition for the existence of a Gâteaux smooth norm on C0(Υ), where Υ is a tree. This criterion is directly analogous to the corresponding equivalent condition for Fréchet smooth norms. In addition, we prove that if C0(Υ) admits a Gâteaux smooth lattice norm then it also admits a lattice norm with strictly convex dual norm.

متن کامل

Automata Theory on Trees and Partial Orders

The paper reviews recent results which aim at generalizing nite automata theory from words and trees to labelled partial orders (presented as labelled directed acyclic graphs), with an emphasis on logical aspects. As an important type of labelled partial order we consider pictures (two-dimensional words). Graph acceptors and their specialization for pictures, \tiling systems", are presented, an...

متن کامل

Hyperplane arrangements, interval orders, and trees.

A hyperplane arrangement is a finite set of hyperplanes in a real affine space. An especially important arrangement is the braid arrangement, which is the set of all hyperplanes xi - xj = 1, 1 </= i < j </= n, in Rn. Some combinatorial properties of certain deformations of the braid arrangement are surveyed. In particular, there are unexpected connections with the theory of interval orders and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1990

ISSN: 0166-218X

DOI: 10.1016/0166-218x(90)90145-3